Constrained bipartite edge coloring with applications to wavelength routing
Identifieur interne : 002491 ( Main/Exploration ); précédent : 002490; suivant : 002492Constrained bipartite edge coloring with applications to wavelength routing
Auteurs : Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1997.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: Motivated by the problem of efficient routing in all-optical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an L-regular bipartite graph are already colored with αL different colors, then the rest of the edges can be colored using at most (1+α/2)L colors. We also show that this bound is tight by constructing instances in which (1+α/2)L colors are indeed necessary. We also obtain tight bounds on the number of colors that each pair of opposite vertices can see. Using the above results, we obtain a polynomial time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed fiber tree using at most 5/3L wavelengths. This improves previous results of [9, 7, 6, 10]. We also obtain that no greedy algorithm can in general use less than 5/3L wavelengths for a set of requests of load L in a directed fiber tree, and thus that our algorithm is optimal in the class of greedy algorithms which includes the algorithms presented in [9, 7, 6, 10].
Url:
DOI: 10.1007/3-540-63165-8_205
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001760
- to stream Istex, to step Curation: 001645
- to stream Istex, to step Checkpoint: 000F63
- to stream Main, to step Merge: 002926
- to stream PascalFrancis, to step Corpus: 001366
- to stream PascalFrancis, to step Curation: 001626
- to stream PascalFrancis, to step Checkpoint: 001067
- to stream Main, to step Merge: 002A49
- to stream Main, to step Curation: 002491
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constrained bipartite edge coloring with applications to wavelength routing</title><author><name sortKey="Kaklamanis, Christos" sort="Kaklamanis, Christos" uniqKey="Kaklamanis C" first="Christos" last="Kaklamanis">Christos Kaklamanis</name></author><author><name sortKey="Persiano, Pino" sort="Persiano, Pino" uniqKey="Persiano P" first="Pino" last="Persiano">Pino Persiano</name></author><author><name sortKey="Erlebach, Thomas" sort="Erlebach, Thomas" uniqKey="Erlebach T" first="Thomas" last="Erlebach">Thomas Erlebach</name></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5089C8FA2DB65DC05C6725802BA1DB7068388660</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1007/3-540-63165-8_205</idno><idno type="url">https://api.istex.fr/document/5089C8FA2DB65DC05C6725802BA1DB7068388660/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001760</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001760</idno><idno type="wicri:Area/Istex/Curation">001645</idno><idno type="wicri:Area/Istex/Checkpoint">000F63</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F63</idno><idno type="wicri:doubleKey">0302-9743:1997:Kaklamanis C:constrained:bipartite:edge</idno><idno type="wicri:Area/Main/Merge">002926</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:97-0454369</idno><idno type="wicri:Area/PascalFrancis/Corpus">001366</idno><idno type="wicri:Area/PascalFrancis/Curation">001626</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001067</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001067</idno><idno type="wicri:doubleKey">0302-9743:1997:Kaklamanis C:constrained:bipartite:edge</idno><idno type="wicri:Area/Main/Merge">002A49</idno><idno type="wicri:Area/Main/Curation">002491</idno><idno type="wicri:Area/Main/Exploration">002491</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Constrained bipartite edge coloring with applications to wavelength routing</title><author><name sortKey="Kaklamanis, Christos" sort="Kaklamanis, Christos" uniqKey="Kaklamanis C" first="Christos" last="Kaklamanis">Christos Kaklamanis</name><affiliation wicri:level="1"><country xml:lang="fr">Grèce</country><wicri:regionArea>Computer Technology Institute, University of Patras, Rio</wicri:regionArea><wicri:noRegion>Rio</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Grèce</country></affiliation></author><author><name sortKey="Persiano, Pino" sort="Persiano, Pino" uniqKey="Persiano P" first="Pino" last="Persiano">Pino Persiano</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Dipartimento di Informatica ed Appl., Università di Salerno, I-84081, Baronissi</wicri:regionArea><wicri:noRegion>Baronissi</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author><author><name sortKey="Erlebach, Thomas" sort="Erlebach, Thomas" uniqKey="Erlebach T" first="Thomas" last="Erlebach">Thomas Erlebach</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Institut für Informatik, TU München, D-80290, München</wicri:regionArea><placeName><settlement type="city">Munich</settlement><region type="land" nuts="1">Bavière</region><region type="district" nuts="2">District de Haute-Bavière</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV-Mathematik, Universität Trier, Postfach 3825, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1997</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">5089C8FA2DB65DC05C6725802BA1DB7068388660</idno><idno type="DOI">10.1007/3-540-63165-8_205</idno><idno type="ChapterID">47</idno><idno type="ChapterID">Chap47</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Data transmission</term><term>Optimal algorithm</term><term>Telecommunication network</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme optimal</term><term>Informatique théorique</term><term>Réseau télécommunication</term><term>Transmission donnée</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Motivated by the problem of efficient routing in all-optical networks, we study a constrained version of the bipartite edge coloring problem. We show that if the edges adjacent to a pair of opposite vertices of an L-regular bipartite graph are already colored with αL different colors, then the rest of the edges can be colored using at most (1+α/2)L colors. We also show that this bound is tight by constructing instances in which (1+α/2)L colors are indeed necessary. We also obtain tight bounds on the number of colors that each pair of opposite vertices can see. Using the above results, we obtain a polynomial time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed fiber tree using at most 5/3L wavelengths. This improves previous results of [9, 7, 6, 10]. We also obtain that no greedy algorithm can in general use less than 5/3L wavelengths for a set of requests of load L in a directed fiber tree, and thus that our algorithm is optimal in the class of greedy algorithms which includes the algorithms presented in [9, 7, 6, 10].</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Grèce</li><li>Italie</li></country><region><li>Bavière</li><li>District de Haute-Bavière</li></region><settlement><li>Munich</li></settlement></list><tree><country name="Grèce"><noRegion><name sortKey="Kaklamanis, Christos" sort="Kaklamanis, Christos" uniqKey="Kaklamanis C" first="Christos" last="Kaklamanis">Christos Kaklamanis</name></noRegion><name sortKey="Kaklamanis, Christos" sort="Kaklamanis, Christos" uniqKey="Kaklamanis C" first="Christos" last="Kaklamanis">Christos Kaklamanis</name></country><country name="Italie"><noRegion><name sortKey="Persiano, Pino" sort="Persiano, Pino" uniqKey="Persiano P" first="Pino" last="Persiano">Pino Persiano</name></noRegion><name sortKey="Persiano, Pino" sort="Persiano, Pino" uniqKey="Persiano P" first="Pino" last="Persiano">Pino Persiano</name></country><country name="Allemagne"><region name="Bavière"><name sortKey="Erlebach, Thomas" sort="Erlebach, Thomas" uniqKey="Erlebach T" first="Thomas" last="Erlebach">Thomas Erlebach</name></region><name sortKey="Erlebach, Thomas" sort="Erlebach, Thomas" uniqKey="Erlebach T" first="Thomas" last="Erlebach">Thomas Erlebach</name><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002491 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002491 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5089C8FA2DB65DC05C6725802BA1DB7068388660
|texte= Constrained bipartite edge coloring with applications to wavelength routing
}}
| This area was generated with Dilib version V0.6.31. |  |